Faint and clustered components in exponential analysis

نویسندگان

  • Annie A. M. Cuyt
  • Min-nan Tsai
  • Marleen Verhoye
  • Wen-shin Lee
چکیده

An important hurdle in multi-exponential analysis is the correct detection of the number of components in a multi-exponential signal and their subsequent identification. This is especially difficult if one or more of these terms are faint and/or covered by noise. We present an approach to tackle this problem and illustrate its usefulness in motor current signature analysis (MCSA), relaxometry (in FLIM and MRI) and magnetic resonance spectroscopy (MRS). The approach is based on viewing the exponential analysis as a Padé approximation problem and makes use of some well-known theorems from Padé approximation theory. We show how to achieve a clear separation of signal and noise by computing sufficiently high order Padé approximants, thus modeling both the signal and the noise, rather than filtering out the noise at an earlier stage and return a low order approximant. We illustrate the usefulness of the approach in different practical situations, where some exponential components are difficult to detect and retrieve because they are either faint compared to the other signal elements or contained in a cluster of similar exponential components.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using Clustering and Factor Analysis in Cross Section Analysis Based on Economic-Environment Factors

Homogeneity of groups in studies those use cross section and multi-level data is important. Most studies in economics especially panel data analysis need some kinds of homogeneity to ensure validity of results. This paper represents the methods known as clustering and homogenization of groups in cross section studies based on enviro-economics components. For this, a sample of 92 countries which...

متن کامل

Stochastic Comparisons of Series and Parallel Systems with Heterogeneous Extended Generalized Exponential Components

In this paper, we discuss the usual stochastic‎, ‎likelihood ratio, ‎dispersive and convex transform order between two parallel systems with independent heterogeneous extended generalized exponential components. ‎We also establish the usual stochastic order between series systems from two independent heterogeneous extended generalized exponential samples. ‎Finally, ‎we f...

متن کامل

Precise Interprocedural Dependence Analysis of Parallel Programs ? Markus Müller - Olm

It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute atomically. We show that these problems become decidable, if this assumption is abandoned. So, the (unrealistic) idealization from program verification “atomic execution of base statements” introduced in order to simp...

متن کامل

Clustering analysis of seismicity and aftershock identification.

We introduce a statistical methodology for clustering analysis of seismicity in the time-space-energy domain and use it to establish the existence of two statistically distinct populations of earthquakes: clustered and nonclustered. This result can be used, in particular, for nonparametric aftershock identification. The proposed approach expands the analysis of Baiesi and Paczuski [Phys. Rev. E...

متن کامل

The Coma Cluster Luminosity Function from Ultraviolet to Near–infrared

The Coma cluster luminosity function (LF) from ultraviolet (2000Å) to the near–infrared (H band) is summarized. In the U V the LF is very steep, much steeper than in the optical. The steep Coma U V LF implies that faint and bright galaxies give similar contributions to the total U V flux and to the total metal production rate. The Coma U V LF is dominated in number and luminosity by blue galaxi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 327  شماره 

صفحات  -

تاریخ انتشار 2018